Criticality Aware Multiprocessors

نویسندگان

  • Sandeep Navada
  • Anil Krishna
چکیده

1. Overview Typically, a memory request from a processor may need to go through many intermediate interconnect routers, directory node, owner node, etc before it is finally serviced. Current multiprocessors do not give preference to any particular memory request. But certain memory requests are more critical to multiprocessor's performance than other requests [4][5]. Example: memory requests from critical sections, load request feeding into multiple dependent instructions, etc. This knowledge can be used to improve the performance of current multiprocessors by letting the ordering point and the interconnect routers prioritize critical requests over non-critical ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global mixed-criticality scheduling on multiprocessors

The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered, when inter-processor migration is permitted. A scheduling algorithm is derived and proved correct, and its properties investigated. Theoretical analysis (in the form of both a speedup factor and sufficient schedulability conditions) as well as extensive simulation exp...

متن کامل

On Identifying Instruction Criticality for Energy-Aware Applications

Recent studies show that microprocessor performance or its energy efficiency can be improved, if we utilize information regarding instruction criticality. This paper investigates why we could not achieve low energy consumption and high performance simultaneously, and reveals there is a fundamental problem in heuristics to identify critical in-

متن کامل

Fault Tolerance in Real Time Multiprocessors - Embedded Systems

All real time tasks which are termed as critical tasks by nature have to complete its execution before its deadline, even in presence of faults. The most popularly used real time task assignment algorithms are First Fit (FF), Best Fit (BF), Bin Packing (BP).The common task scheduling algorithms are Rate Monotonic (RM), Earliest Deadline First (EDF) etc.All the current approaches deal with eithe...

متن کامل

Hard Real Time and Mixed Time Criticality on Off-The-Shelf Embedded Multi-Cores

The paper describes a pragmatic solution to the parallel execution of hard real-time tasks on off-the-shelf embedded multiprocessors. We propose a simple timing isolation protocol allowing computational tasks to communicate with hard real-time ones. Excellent parallel resource utilization can be achieved while preserving timing compositionality. An extension to a synchronous language enables th...

متن کامل

Physical-State-Aware Dynamic Slack Management for Mixed-Criticality Systems

Safety-critical cyber-physical systems like autonomous cars require not only different levels of assurance, but also close interactions with dynamically-changing physical environments. While the former has been studied extensively by exploiting the notion of mixed-criticality (MC) systems, the latter has not, especially in conjunction with MC systems. To fill this important gap, we conduct an i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1606.05933  شماره 

صفحات  -

تاریخ انتشار 2016